CASPA: Symbolic model checking of stochastic systems
نویسندگان
چکیده
This note describes the new features of the performance evaluation tool CASPA, which has been extended by algorithms for the model checking of stochastic systems. CASPA uses stochastic process algebras as its input language. Multi-terminal binary decision diagrams (MTBDD) are employed to represent the transition system underlying a given process algebraic specification. The specification of performability requirements can be done using a newly developed stochastic temporal logic. All phases of modelling, from model construction to model checking and numerical analysis, are based entirely on MTBDDs.
منابع مشابه
CASPA: A Tool for Symbolic Performance and Dependability Evaluation
Symbolic data structures, such as binary decision diagrams (BDD) [1] and variants thereof have proved to be suitable for the efficient generation and compact representation of very large state spaces and transition systems. The key to such compact representation is the exploitation of the compositional structure of a given specification [2], [3]. It is also known that in addition to functional ...
متن کاملSymbolic Performance and Dependability Evaluation with the Tool CASPA
This paper describes the tool CASPA, a new performance evaluation tool which is based on a Markovian stochastic process algebra. CASPA uses multi-terminal binary decision diagrams (MTBDD) to represent the labelled continuous time Markov chain (CTMC) underlying a given process algebraic specification. All phases of modelling, from model construction to numerical analysis and measure computation,...
متن کاملPath-based calculation of MTTFF, MTTFR and asymptotic unavailability with the stochastic process algebra tool CASPA
CASPA is a stochastic process algebra tool for performance and dependability modelling, analysis and verification. It is based entirely on the symbolic data structure MTBDD (Multi-Terminal Binary Decision Diagram) which enables the tool to handle models with very large state space. This paper describes an extension of CASPA’s solving engine for path-based approximation of MTTFF (Mean Time To Fi...
متن کاملA New Algorithm for Partitioned Symbolic Reachability Analysis
Binary Decision Diagrams (BDDs) and their multi-terminal extensions have shown to be very helpful for the quantitative verification of systems. Many different approaches have been proposed for deriving symbolic state graph (SG) representations from high-level model descriptions, where compositionality has shown to be crucial for the efficiency of the schemes. Since the symbolic composition sche...
متن کاملSymbolic Model Checking of Stochastic Reward Nets
This paper describes a symbolic model checking approach for the Continuous Stochastic Reward Logic (CSRL) and stochastic reward nets, stochastic Petri nets augmented with rate rewards. CSRL model checking requires the computation of the joint distribution of time and accumulated reward, which is done by Markovian approximation. An implementation is available in the model checker MARCIE. It appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006